package com.dyz.leetcode;

public class LowestCommonAncestor236 {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root==null){return null;}
        if(root.val==p.val||root.val==q.val){return root;}

        //递归
        TreeNode left = lowestCommonAncestor(root.left, p, q);
        TreeNode right = lowestCommonAncestor(root.right, p, q);

        if(left!=null && right!=null){return root;}
        if(left==null){return right;}
        if(right==null){return left;}

        return null;

    }
}
